skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 2

Search for: All records

Creators/Authors contains: "Bello-Cruz, Yunier"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ; (, SIAM Journal on Optimization)
    In this paper, we present a variant of the circumcenter method for the Convex Feasibility Problem (CFP), ensuring finite convergence under a Slater assumption. The method replaces exact projections onto the convex sets with projections onto separating halfspaces, perturbed by positive exogenous parameters that decrease to zero along the iterations. If the perturbation parameters decrease slowly enough, such as the terms of a diverging series, finite convergence is achieved. To the best of our knowledge, this is the first circumcenter method for CFP that guarantees finite convergence. 
    more » « less
    Full Text Available 
  2. ; (, Journal of integer sequences)
    Accepted Manuscript Full Text Available
  3. ; ; ; (, Mathematical Programming)
    Full Text Available 
  4. ; (, Integers)
    In this paper, we provide a comprehensive solution to the open problem regarding the existence of a recurrence formula for computing fixed points of the Josephus function precisely when the reduction constant is three. Incorporating this formula into recursive algorithms significantly improves addressing the Josephus problem, particularly for large inputs. 
    more » « less
    Full Text Available 
  5. ; ; ; ; (, Computational Optimization and Applications)
    Full Text Available 
  6. ; ; (, Journal of Optimization Theory and Applications)
    Full Text Available 
  7. ; ; (, Numerical Algorithms)
    Full Text Available 
  8. ; ; (, Optimization)
    Full Text Available 
  9. ; ; (, SIAM Journal on Optimization)
    Full Text Available 
  10. ; ; ; ; (, Computational Optimization and Applications)
    Full Text Available